From Timed Automata to Logic | and Back ? Fran
نویسندگان
چکیده
In this paper, we deene a timed logic L which is suuciently expressive that we for any timed automaton may construct a single characteristic L formula uniquely characterizing the automaton up to timed bisimilarity. Also, we prove decidability of the satissability problem for L with respect to given bounds on the number of clocks and constants of the timed automata to be constructed.
منابع مشابه
Back to the Future: Towards a Theory of Timed Regular Languages
Timed automata are nite-state machines constrained by timing requirements so that they accept timed words | words in which every symbol is labeled with a real-valued time. These automata were designed to lead to a theory of nite-state real-time properties with applications to the automatic veri cation of real-time systems. However, both deterministic and nondeterministic versions su er from dra...
متن کاملFrom Timed Automata to Logic - and Back
One of the most successful techniques for automatic verification is that of model checking. For finite automata there exist since long extremely efficient model–checking algorithms, and in the last few years these algorithms have been made applicable to the verification of real–time automata using the region–techniques of Alur and Dill. In this paper, we continue this transfer of existing techn...
متن کاملTimed-Automata-Based Verification of MITL over Signals
It has been argued that the most suitable semantic model for real-time formalisms is the nonnegative real line (signals), i.e. the continuous semantics, which naturally captures the continuous evolution of system states. Existing tools like Uppaal are, however, based on ω-sequences with timestamps (timed words), i.e. the pointwise semantics. Furthermore, the support for logic formalisms is very...
متن کاملUsing Interval Petri Nets and Timed Automata for Diagnosis of Discrete Event Systems (DES)
A discrete event system (DES) is a dynamic system that evolves in accordance with the abrupt occurrence, at possibly unknown irregular intervals, of physical events. Because of the special nature of these systems, different tools are currently used for their analysis, design and modeling. The main focus of this paper is the presentation of a new modeling approach of Discrete Event Systems. The ...
متن کاملRobust Timed Automata
We de ne robust timed automata, which are timed automata that accept all trajectories \robustly": if a robust timed automaton accepts a trajectory, then it must accept neighboring trajectories also; and if a robust timed automaton rejects a trajectory, then it must reject neighboring trajectories also. We show that the emptiness problem for robust timed automata is still decidable, by modifying...
متن کامل